Cube polynomial of Fibonacci and Lucas cubes
نویسندگان
چکیده
The cube polynomial of a graph is the counting polynomial for the number of induced k-dimensional hypercubes (k ≥ 0). We determine the cube polynomial of Fibonacci cubes and Lucas cubes, as well as the generating functions for the sequences of these cubes. Several explicit formulas for the coefficients of these polynomials are obtained, in particular they can be expressed with convolved Fibonacci numbers. Zeros of the studied cube polynomials are explicitly determined. Consequently, the coefficients sequences of cube polynomials of Fibonacci and Lucas cubes are unimodal.
منابع مشابه
The (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملWiener Index and Hosoya Polynomial of Fibonacci and Lucas Cubes
In the language of mathematical chemistry, Fibonacci cubes can be defined as the resonance graphs of fibonacenes. Lucas cubes form a symmetrization of Fibonacci cubes and appear as resonance graphs of cyclic polyphenantrenes. In this paper it is proved that the Wiener index of Fibonacci cubes can be written as the sum of products of four Fibonacci numbers which in turn yields a closed formula f...
متن کاملOn the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
Let Γn and Λn be the n-dimensional Fibonacci cube and Lucas cube, respectively. The domination number γ of Fibonacci cubes and Lucas cubes is studied. In particular it is proved that γ(Λn) is bounded below by ⌈ Ln−2n n−3 ⌉ , where Ln is the n-th Lucas number. The 2-packing number ρ of these cubes is also studied. It is proved that ρ(Γn) is bounded below by 2 blg nc 2 −1 and the exact values of ...
متن کاملConnectivity of Fibonacci cubes, Lucas cubes, and generalized cubes
If f is a binary word and d a positive integer, then the generalized Fibonacci cube Qd(f) is the graph obtained from the d-cube Qd by removing all the vertices that contain f as a factor, while the generalized Lucas cube Qd( ↽Ð f ) is the graph obtained from Qd by removing all the vertices that have a circulation containing f as a factor. The Fibonacci cube Γd and the Lucas cube Λd are the grap...
متن کاملAsymptotic properties of Fibonacci cubes and Lucas cubes
It is proved that the asymptotic average eccentricity and the asymptotic average degree of both Fibonacci cubes and Lucas cubes are (5 + √ 5)/10 and (5 − √ 5)/5, respectively. A new labeling of the leaves of Fibonacci trees is introduced and it is proved that the eccentricity of a vertex of a given Fibonacci cube is equal to the depth of the associated leaf in the corresponding Fibonacci tree. ...
متن کامل